An Amendment of Fast Subspace Tracking Methods

نویسندگان

  • Zhu Cheng
  • Zhan Wang
  • Haitao Liu
  • Majid Ahmadi
چکیده

Tuning stepsize between convergence rate and steady state error level or stability is a problem in some subspace tracking schemes. Methods in DPM and OJA class may show sparks in their steady state error sometimes, even with a rather small stepsize. By a study on the schemes’ updating formula, it is found that the update only happens in a specific plane but not all the subspace basis. Through an analysis on relationship between the vectors in that plane, an amendment as needed is made on the algorithm routine to fix the problem by constricting the stepsize at every update step. The simulation confirms elimination of the sparks. Array signal processing; subspace tracking; stepsize; convergence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Look at the Power Method for Fast Subspace Tracking

Hua, Yingbo, Xiang, Yong, Chen, Tianping, Abed-Meraim, Karim, and Miao, Yongfeng, A New Look at the Power Method for Fast Subspace Tracking, Digital Signal Processing 9 (1999), 297–314. A class of fast subspace tracking methods such as the Oja method, the projection approximation subspace tracking (PAST) method, and the novel information criterion (NIC) method can be viewed as power-based metho...

متن کامل

Fast, accurate subspace tracking using operator restriction analysis

A new noniterative subspace tracking method is presented. This method is called the operator restriction algorithm (OPERA) and it can be used whenever an update to the principal components of an EVD or SVD of a rank-one update of a given matrix is needed. The updating algorithms are based on the technique of restricting a linear operator to a subspace and the concept of an invariant subspace an...

متن کامل

A Fast Signal Subspace Tracking Algorithm Based on a Subspace Information Criterion

In this paper, we present a new algorithm for tracking the signal subspace recursively. It is based on a new interpretation of the signal subspace. We introduce a novel information criterion for signal subspace estimation. We show that the solution of the proposed constrained optimization problem results the signal subspace. In addition, we introduce three adaptive algorithms which can be used ...

متن کامل

A fast algorithm for subspace tracking

Fast estimation and tracking of the principal subspace of a sequence of random vectors is a classic problem, widely encountered in areas such as radar, sonar and speech processing, data compression, data filtering, parameter estimation, pattern recognition, neural analysis, wireless communications, to name just a few. Among the most robust algorithms for subspace tracking there are the so calle...

متن کامل

Fast Time-varying modal parameter identification algorithm based on two-layer linear neural network learning for subspace tracking

* This work is supported by NSF Grant #10672045 to Yu Kaiping Abstract—The key of fast identification algorithm of time-varying modal parameter based on subspace tracking is to find efficient and fast subspace-tracking algorithm. This paper presents a modified version of NIC(Novel Information Criterion) adopted in two-layer linear neural network learning for subspace tracking, which is applied ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011